翻訳と辞書
Words near each other
・ "O" Is for Outlaw
・ "O"-Jung.Ban.Hap.
・ "Ode-to-Napoleon" hexachord
・ "Oh Yeah!" Live
・ "Our Contemporary" regional art exhibition (Leningrad, 1975)
・ "P" Is for Peril
・ "Pimpernel" Smith
・ "Polish death camp" controversy
・ "Pro knigi" ("About books")
・ "Prosopa" Greek Television Awards
・ "Pussy Cats" Starring the Walkmen
・ "Q" Is for Quarry
・ "R" Is for Ricochet
・ "R" The King (2016 film)
・ "Rags" Ragland
・ ! (album)
・ ! (disambiguation)
・ !!
・ !!!
・ !!! (album)
・ !!Destroy-Oh-Boy!!
・ !Action Pact!
・ !Arriba! La Pachanga
・ !Hero
・ !Hero (album)
・ !Kung language
・ !Oka Tokat
・ !PAUS3
・ !T.O.O.H.!
・ !Women Art Revolution


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Number theoretic transform : ウィキペディア英語版
Discrete Fourier transform (general)

This article is about the discrete Fourier transform (DFT) over any ring, commonly called a number-theoretic transform (NTT) in the case of finite fields. For specific information on the discrete Fourier transform over the complex numbers, see discrete Fourier transform.
==Definition==
Let R be any ring, let n\geq 1 be an integer, and let \alpha \in R be a principal ''n''th root of unity, defined by:〔Martin Fürer, "(Faster integer multiplication )", STOC 2007 Proceedings, pp. 57–66. Section 2: The Discrete Fourier Transform.〕
*\alpha^n = 1
*\sum_^ \alpha^ = 0 for 1 \leq k < n \qquad (1)
The discrete Fourier transform maps an n-tuple (v_0,\ldots,v_) of elements of R to another n-tuple (f_0,\ldots,f_) of elements of R according to the following formula:
:f_k = \sum_^ v_j\alpha^.\qquad (2)
By convention, the tuple (v_0,\ldots,v_) is said to be in the ''time domain'' and the index j is called ''time''. The tuple (f_0,\ldots,f_) is said to be in the ''frequency domain'' and the index k is called ''frequency''. The tuple (f_0,\ldots,f_) is also called the ''spectrum'' of (v_0,\ldots,v_). This terminology derives from the applications of Fourier transforms in signal processing.
If R is an integral domain (which includes fields), it is sufficient to choose \alpha as a primitive ''n''th root of unity, which replaces the condition (1) by:〔
:\alpha^ \ne 1 for 1 \leq k < n
Proof: take \beta = \alpha^k with 1 \leq k < n. Since \alpha^n=1, \beta^n=(\alpha^n)^k=1, giving:
:\beta^n-1 = (\beta-1)\left(\sum_^ \beta^j\right) = 0
where the sum matches (1). Since \alpha is a primitive root of unity, \beta - 1 \ne 0. Since R is an integral domain, the sum must be zero. ∎
Another simple condition applies in the case where ''n'' is a power of two: (1) may be replaced by \alpha^ = -1.〔

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Discrete Fourier transform (general)」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.